#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int n;
vector<int> a;
vector<bool> check;
int cnt;

int main()
{
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);

    ios::sync_with_stdio(false);
    cin.tie(0);

    cin >> n;
    a.resize(n+5);
    check.resize(n+5, false);
    for (int i = 1 ; i <= n ; i++)
        cin >> a[i];
    sort(a.begin()+1, a.begin()+1+n);
    cnt = n;
    {
        int i = 1, j = i+1;
        while (i <= n && j <= n)
        {
            while (j <= n && a[i] == a[j])
                j++;
            int temp = j;
            while (i < temp && j <= n)
            {
                if (check[j] == true)
                {
                    j++;
                    continue;
                }
                cnt--;
                check[j] = true;
                i++; j++;
            }
            i = temp;
            j = i+1;
        }
    }
    cout << cnt << endl;
    return 0;
}